Search results for "finite [mass]"
showing 10 items of 356 documents
Jauni ieskati kvantu automātu stāvokļu skaita efektivitātē
2022
Kvantu galīgi automāti var sasniegt eksponenciālu stāvokļu skaitu efektivitāti, salīdzinot ar determinētiem galīgiem automātiem. Viena problēma, kurā ir zināms, ka kvantu galīgiem automātiem ir eksponenciālas priekšrocības, ir MODn problēma, taču nav zināma metode, kā uzkonstruēt tādu kvantu automātu. Šajā darbā eksponenciāli efektīvie MODn algoritmi tiek vispārināti jaunā algoritmā, kas samazina vajadzīgo stāvokļu skaitu. Jaunā algoritma saaistības ar esošiem virzieniem literatūrā tiek aprakstītas, un tiek piedāvātas divas jaunas skaitļu virknes, kuras varētu izmantot, lai uzkonstruētu tādus kvantu automātus.
Inclusive photoproduction of bottom quarks for low and medium p T in the general-mass variable-flavour-number scheme
2016
We present predictions for b-quark production in photoprodcution and compare with experimental data from HERA. Our theoretical predictions are obtained at next-to-leading-order in the general-mass variable-flavor-number scheme, an approach which takes into account the finite mass of the b quarks. We use realistic evolved nonperturbative fragmentation functions obtained from fits to e+e- data. We find in general good agreement of data with both the GM-VFNS and the FFNS calculations, while the more precise ZEUS data seem to prefer the GM-VFNS predictions.
Iterative constructions of central conic arcs using non-stationary IFS
2012
Several methods of subdivision exist to build parabola arcs or circle arcs in the usual Euclidean affine plane. Using a compass and a ruler, it is possible to construct, from three weighted points, circles arcs in the affine space without projective considerations. This construction is based on rational quadratic Bézier curve properties. However, when the conic is an ellipse or a hyperbola, the weight computation is relatively hard. As the equation of a conic is $\qaff(x,y)=1$, where $\qaff$ is a quadratic form, one can use the pseudo-metric associed to $\qaff$ in the affine plane and then, the conic geometry is also handled as an Euclidean circle. At each step of the iterative algorithm, t…
Varieties Generated by Certain Models of Reversible Finite Automata
2006
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of Kondacs-Watrous quantum finite automata. In this paper we consider some of the algebraic properties of RFA, namely the varieties these automata generate. Consequently, we obtain a characterization of the boolean closure of the classes of languages recognized by these models.
Comparison between the MHFEM formulation and a 2nd spatial order FV formulation of the linear groundwater flow problem
2008
Mixed and Mixed Hybrid Finite Elements (MHFE) methods have been widely used in the last decade for simulation of groundwater flow problem, petroleum reservoir problems, potential flow problems, etc. The main advantage of these methods is that, unlike the classical Galerkin approach, they guarantee local and global mass balance, as well the flux continuity between inter-element sides. The simple shape of the control volume, where the mass conservation is satisfied, makes also easier to couple this technique with a Finite Volume technique in the time splitting approach for the solution of advection-dispersion problems. In the present paper a new second spatial approximation order Finite Volum…
Comparison between the MHFEM formulation and a 2nd spatial order FV formulation of the linear ground problem
2008
Comparison of different 2nd order formulations for the solution of the 2D groundwater flow problem over irregular triangular meshes
2009
Mixed and Mixed Hybrid Finite Elements (MHFE) methods have been widely used in the last decade for simulation of groundwater flow problem, petroleum reservoir problems, potential flow problems, etc. The main advantage of these methods is that, unlike the classical Galerkin approach, they guarantee local and global mass balance, as well the flux continuity between inter-element sides. The simple shape of the control volume, where the mass conservation is satisfied, makes also easier to couple this technique with a Finite Volume technique in the time splitting approach for the solution of advection-dispersion problems. In the present paper, a new MHFE formulation is proposed for the solution …
Forward light-by-light scattering and electromagnetic correction to hadronic vacuum polarization
2023
Lattice QCD calculations of the hadronic vacuum polarization (HVP) have reached a precision where the electromagnetic (e.m.) correction can no longer be neglected. This correction is both computationally challenging and hard to validate, as it leads to ultraviolet (UV) divergences and to sizeable infrared (IR) effects associated with the massless photon. While we precisely determine the UV divergence using the operator-product expansion, we propose to introduce a separation scale $\Lambda\sim400\;$MeV into the internal photon propagator, whereby the calculation splits into a short-distance part, regulated in the UV by the lattice and in the IR by the scale $\Lambda$, and a UV-finite long-di…
The Syllogistic with Unity
2011
We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.